|
In logic, a conditional quantifier is a kind of Lindström quantifier (or generalized quantifier) ''Q''''A'' that, relative to a classical model ''A'', satisfies some or all of the following conditions ("''X''" and "''Y''" range over arbitrary formulas in one free variable): (The implication arrow denotes material implication in the metalanguage.) The ''minimal conditional logic'' M is characterized by the first six properties, and stronger conditional logics include some of the other ones. For example, the quantifier ∀''A'', which can be viewed as set-theoretic inclusion, satisfies all of the above except (). Clearly () holds for ∃''A'' while e.g. () fails. A semantic interpretation of conditional quantifiers involves a relation between sets of subsets of a given structure—i.e. a relation between properties defined on the structure. Some of the details can be found in the article Lindström quantifier. Conditional quantifiers are meant to capture certain properties concerning conditional reasoning at an abstract level. Generally, it is intended to clarify the role of conditionals in a first-order language as they relate to other connectives, such as conjunction or disjunction. While they can cover nested conditionals, the greater complexity of the formula, specifically the greater the number of conditional nesting, the less helpful they are as a methodological tool for understanding conditionals, at least in some sense. Compare this methodological strategy for conditionals with that of first-degree entailment logics. ==References== Serge Lapierre. Conditionals and Quantifiers, in ''Quantifiers, Logic, and Language'', Stanford University, pp. 237–253, 1995. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Conditional quantifier」の詳細全文を読む スポンサード リンク
|